Some finitely presented groups of cohomological dimension two with property (FA)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Dimension of Finitely Presented Groups

We prove that if a finitely presented group is one-ended then its asymptotic dimension is bigger than 1. It follows that a finitely presented group of asymptotic dimension 1 is virtually free.

متن کامل

Distortion of Wreath Products in Some Finitely Presented Groups

Wreath products such as Z ≀ Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z ≀ Z as a subgroup of Thompson’s group F and as a subgroup of Baumslag’s metabelian group G. We find that Z ≀ Z is undistorted in F but is at least exponentially distorted in G.

متن کامل

Finitely Presented Residually Free Groups

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all n ∈ N, a residually free group is of type FPn if and only if it is of type Fn. New families of subdirect products of free groups are constructed, including the first examples of finitely presented subgroups ...

متن کامل

Finitely Presented Subgroups of a Product of Two Free Groups

We use van Kampen diagram techniques to give a new geometric proof of Baumslag and Roseblade’s result that a non–free finitely presented subgroup of a direct product of two free groups is virtually a product of subgroups of the factors.

متن کامل

Constructing Matrix Representations of Finitely Presented Groups

The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1983

ISSN: 0022-4049

DOI: 10.1016/0022-4049(83)90105-6